Partitioning Algorithms in Vlsi Physical Designs – a Review
نویسندگان
چکیده
Initial electronic design automation is concerned with the design and production of VLSI systems. The next important step in creating a VLSI circuit is Physical Design. Physical design problems are combinatorial in nature and of large problem sizes. Due to its complexity, the physical design is normally divided into various sub-steps. The circuit has to be partitioned to get some (up to 50) macro cells which have to be placed on the chip (floor-planning). In the routing phase pins on the walls of these modules have to be connected. The last step in the physical design is the compaction of the layout, where it is compressed in all dimensions so that the total area is reduced. This survey paper aims at a study on Efficient Algorithms for Partitioning in VLSI design and observes the common traits of the superior contributions.
منابع مشابه
Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملPartitioning in 3D VLSI Physical Design – A Brief Survey
Partitioning plays an increasingly very important role in the physical design process of VLSI circuits and systems. There are partitioning problems to be solved on all levels of abstraction. The available algorithm technology determines how effectively we can address a given partitioning formulation and optimize a given objective. In 3D, the partitioned units are assigned to a particular layer....
متن کاملA Study on Various Data Mining Algorithms Pertaining to VLSI Cell Partitioning
VLSI Cell Partitioning plays a substantial part in VLSI physical design. The task of designing integrated circuits is multifaceted, as modern circuits have a very huge number of modules. It is very much essential to split the circuit into a smaller and meeker logic blocks. In order to build a complex digital integrated circuit, the multi million transistors must be sub-divided into convenientnu...
متن کاملTutorial on VLSI Partitioning
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include two-way, multiway, and multi-level partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning processes. To derive the optimum solutions, we describe the branch and bound method and the dynamic ...
متن کاملPartitioning VLSI circuits on the basis of Genetic Algorithms and Comparative Analysis Of KL And SA Partitioning Algorithms
Circuit partitioning is the one of the fundamental problems in VLSI design. It appears in several stages in VLSI design, such as logic design and physical design. Circuit partitioning is generally formulated as the graph partitioning problem. Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012